Nuclear weapons,existential threats,and the stability–instability paradox

Recent scholarship has largely ignored systematic differences in the existential threats that nuclear-weapon possessors pose to other states. This study theorizes that the capacity to pose existential threats shapes nuclear-armed states’ willingness to use military force against one another. We explore three hypotheses regarding how nuclear-based existential threats can deter conflict or encourage it, including under the conditions proposed by the stability–instability paradox. We rely on a statistical analysis of nuclear-armed dyads from 1950 to 2001 and employ the Nuclear Annihilation Threat (NAT) Index to capture variation in the existential threats nuclear-armed states pose to one another. We find that being able to pose an existential threat to another state emboldens potential initiators to use military force but does not deter attacks. The emboldening effects are particularly strong under the hypothesized conditions of the stability–instability paradox. Our study provides unique contributions to ongoing debates over the political effects of nuclear weapons.     

Extension of Bolzano search to rectangles which preserves rectangles as iterates

Multivariable elimination algorithms, which may be regarded as generalizations of various one-dimensional search procedures, have not found wide application. A probable reason may be the generally very irregularly shaped regions of uncertainty that evolve iteratively in the procedures. Hence hope for practical salvage of this class of algorithms seems to lie in controlling the shape of the successively smaller regions of uncertainty. In this article an extension of Bolzano search to rectangles which preserves rectangular iterates is given. Since the result is essentially geometrical in nature, a geometric proof of this procedure is given. Hopefully the proof procedure will be of independent interest. A numerical illustration of the procedure is given for a game problem, such problems lending themselves to this method.     

A flow-shop problem with sequence-dependent additive setup times

The flow-shop scheduling problem with sequence-dependent additive setup times is considered as a special case of the general problem, and a polynomially bounded approximate method is developed to find a minimum makespan permutation schedule. The approximate algorithm is shown to yield optimal results for the two-machine case. A version of Sule's model is defined that produces the first approximation of the optimal solution for this problem. Computational experience along with numerical examples are provided to test the effectiveness of the method.     

Transient behavior of large Markovian multiechelon repairable item inventory systems using a truncated state space approach

Calculations for large Markovian finite source, finite repair capacity two-echelon repairable item inventory models are shown to be feasible using the randomization technique and a truncated state space approach. More complex models (involving transportation pipelines, multiple-item types and additional echelon levels) are also considered.     

Coalitions & the Legitimisation of UK Security Policy

Abstract

David Moore analyses the role of the Treasury in detemining and controlling defence policy and expenditure, and the place of the MoD within this function.